Mobile Agent Routing Algorithm Based on Improved Ant Colony Algorithm
نویسندگان
چکیده
At the present stage wireless sensor network exists some deficiencies such as finite energy, limited communication capability, multi-hop routing and dynamic topology. In addition too many nodes which are distributed intensively influence also performance of wireless sensor network. Besides distributed optimization problem always impact to efficiency of the network. For data processing and routing selection of wireless sensor network, a new routing algorithm based on mobile agent and ant colony optimization is proposed in the paper. The ant colony algorithm is improved and optimized in the paper. The algorithm can balance between routing efficiency and node loading .So on the one part the computing capability of sensor node and efficiency of data processing are improved. On the other part redundant data and communication consumption are reduced so that life expectancy of sensor is extended. Simulation experiments show that the new routing algorithm could solve the problems of wireless sensor network, and it has good practice application effect. Copyright © 2013 IFSA.
منابع مشابه
Mobile Agent Routing Algorithm in Wireless Sensor Networks
Wireless sensor network is resources-restricted network and similar to traditional mobile ad-hoc networks in the sense that both involve multi-hop communications. An improved ant colony algorithm based on ant colony system is put forward which to find the initial optimal migration path for mobile agent in wireless sensor networks environment. This improved algorithm selects a part of optimal ro...
متن کاملUser-based Vehicle Route Guidance in Urban Networks Based on Intelligent Multi Agents Systems and the ANT-Q Algorithm
Guiding vehicles to their destination under dynamic traffic conditions is an important topic in the field of Intelligent Transportation Systems (ITS). Nowadays, many complex systems can be controlled by using multi agent systems. Adaptation with the current condition is an important feature of the agents. In this research, formulation of dynamic guidance for vehicles has been investigated based...
متن کاملImprovement of Routing Operation Based on Learning with Using Smart Local and Global Agents and with the Help of the Ant Colony Algorithm
Routing in computer networks has played a special role in recent years. The cause of this is the role of routing in a performance of the networks. The quality of service and security is one of the most important challenges in routing due to lack of reliable methods. Routers use routing algorithms to find the best route to a particular destination. When talking about the best path, we consider p...
متن کاملAnt Colony Algorithm for the Single Loop Routing Problem
In this paper, a new algorithm for solving the single loop routing problem is presented. The purpose of the single loop routing problem(SLRP) is to find the shortest loop for an automated guided vehicle covering at least one edge of each department of a block layout. First it shown that this problem can be represented as a graph model. Then a meta-heuristic algorithm based on and colony system ...
متن کاملAnt Colony Algorithm for the Single Loop Routing Problem
In this paper, a new algorithm for solving the single loop routing problem is presented. The purpose of the single loop routing problem(SLRP) is to find the shortest loop for an automated guided vehicle covering at least one edge of each department of a block layout. First it shown that this problem can be represented as a graph model. Then a meta-heuristic algorithm based on and colony system ...
متن کامل